Sets of permutations that generate the symmetric group pairwise
نویسنده
چکیده
The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1 + 1 permutations having this property. For all sufficiently large integers n with n≡ 2 mod 4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. There is no set of 2n−2 + 1 permutations having this property. © 2006 Elsevier Inc. All rights reserved.
منابع مشابه
Sharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملThe symmetric monoidal closed category of cpo $M$-sets
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
متن کاملThe Probability of Generating the Symmetric Group When One of the Generators Is Random
A classical result of John Dixon (1969) asserts that a pair of random permutations of a set of n elements almost surely generates either the symmetric or the alternating group of degree n. We answer the question, “For what permutation groups G ≤ Sn do G and a random permutation σ ∈ Sn almost surely generate the symmetric or the alternating group?” Extending Dixon’s result, we prove that this is...
متن کاملCombinatorics in the group of parity alternating permutations
We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a s...
متن کاملRestricted Symmetric Permutations∗
Pattern-avoiding involutions, which have received much enumerative attention, are patternavoiding permutations which are invariant under the natural action of a certain subgroup of D8, the symmetry group of a square. Three other nontrivial subgroups of D8 also have invariant permutations under this action. For each of these subgroups, we enumerate the set of permutations which are invariant und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 113 شماره
صفحات -
تاریخ انتشار 2006